Minimizing Writes in Parallel External Memory Search
نویسندگان
چکیده
Recent research on external-memory search has shown that disks can be effectively used as secondary storage when performing large breadthfirst searches. We introduce the Write-Minimizing Breadth-First Search (WMBFS) algorithm which is designed to minimize the number of writes performed in an external-memory BFS. WMBFS is also designed to store the results of the BFS for later use. We present the results of a BFS on a single-agent version of Chinese Checkers and the Rubik’s Cube edge cubes, state spaces with about 1 trillion states each. In evaluating against a comparable approach, WMBFS reduces the I/O for the Chinese Checkers domain by over an order of magnitude. In Rubik’s cube, in addition to reducing I/O, the search is also 3.5 times faster. Analysis of the results suggests the machine and state-space properties necessary for WMBFS to perform well.
منابع مشابه
Planar Strong Connectivity
This paper shows that for a strongly connected planar directed graph of size n, a depth-rst search tree rooted a speciied vertex can be computed in O(log 5 n) time using n= logn processors. Previously, for planar directed graphs that may not be strongly connected, the best depth-rst search algorithm runs in O(log 10 n) time using n processors. Both algorithms run on a parallel random access mac...
متن کاملSuperoptimizing Memory Subsystems for Multiple Objectives
We consider the automatic determination of application-specific memory subsystems via superoptimization, with the goals of reducing memory access time and of minimizing writes. The latter goal is of concern for memories with limited write endurance. Our subsystems outperform general-purpose memory subsystems in terms of performance, number of writes, or both.
متن کاملSaving SSD Erase Costs Using WOM Codes
NAND flash, used in modern SSDs, is a write-once medium, where each memory cell must be erased prior to writing. The lifetime of an SSD is limited by the number of erasures allowed on each cell. Thus, minimizing erasures is a key objective in SSD design. A promising approach to eliminate erasures and extend SSD lifetime is to use write-once memory (WOM) codes, designed to accommodate additional...
متن کاملModels and Algorithms under Asymmetric Read and Write Costs
In several emerging non-volatile technologies for main memory (NVRAM) the cost of reading is significantly cheaper than the cost of writing. Such asymmetry in memory costs leads to a desire for “writeefficient” algorithms that minimize the number of writes to the NVRAM. While several prior works have explored write-efficient algorithms for databases or for the unique properties of NAND Flash, o...
متن کاملحل مسئله زمان بندی ماشینهای موازی نامرتبط با اهداف کل زودکرد وزنی و کل دیرکرد وزنی با استفاده از الگوریتم جستجوی پراکنده چند هدفه
The parallel machine scheduling problem is an important and difficult problem to be considered in the real-world situations. Traditionally, this problem consists of the scheduling of a set of independent jobs on parallel machines with the aim of minimizing the maximum job completion. In today's manufacturing systems, in which both early and tardy finishing of job processing are undesired, the o...
متن کامل